Quasi - optimal energy - efficient leader election algorithms 1 in radio networks 2
نویسندگان
چکیده
Radio networks (RN) are distributed systems (ad hoc networks) consisting in n 2 radio stations. Assum8 ing the number n unknown, two distinct models of RN without collision detection (no-CD) are addressed: 9 the model with weak no-CD RN and the one with strong no-CD RN. We design and analyze two distributed 10 leader election protocols, each one running in each of the above two (no-CD RN) models, respectively. Both 11 randomized protocols are shown to elect a leaderwithinO(log (n)) expected time, with no station being awake 12 for more thanO(log log (n)) time slots (such algorithms are said to be energy-efficient). Therefore, a new class 13 of efficient algorithms is set up that match the (log (n)) time lower-bound established by Kushilevitz and 14 Mansour [E. Kushilevitz, Y. Mansour, An (D log (N/D)) lower-bound for broadcast in radio networks, 15 SIAM J. Comp. 27 (1998) 702–712).]. 16 © 2006 Published by Elsevier Inc. 17
منابع مشابه
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
This summary presents two leader election protocols for radio networks, in both telephone and walkie-talkie model, where the number of radios is unknown. Those randomized protocols are shown to elect a leader in O(log n) expected time, and to be energy-efficient due to a small total awake time of the radio stations.
متن کاملQuasi-optimal energy-efficient leader election algorithms in radio networks
Radio networks (RN) are distributed systems (ad hoc networks) consisting in n ≥ 2 radio stations. Assuming the number n unknown, two distinct models of RN without collision detection (no-CD) are addressed: the model with weak no-CD RN and the one with strong no-CD RN. We design and analyze two distributed leader election protocols, each one running in each of the above two (no-CD RN) models, re...
متن کاملA Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
Radio networks (RN) are distributed systems (ad hoc networks) consisting in n ≥ 2 radio stations. Assuming the number n unknown, two distinct models of RN without collision detection (no-CD) are addressed: the model with weak no-CD RN and the one with strong no-CD RN. We design and analyze two distributed leader election protocols, each one running in each of the above two (no-CD RN) models, re...
متن کاملAn Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
In this work we present an energy efficient leader election protocol for anonymous radio network populated with n mobile stations. Previously, Nakano and Olariu have presented a leader election protocol that terminates, with probability exceeding 1 − f ( f ≥ 1), in log log n + o(log log n) + O(log f ) time slots [14]. As the above protocol works under the assumption that every station has the a...
متن کاملAdversary Immune Leader Election in ad hoc Radio Networks
Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection, (no-CD), model. However, these algorithms are fragile in the sense that an adversary may disturb communication at low energy cost so that more than one station may regard itself as a leader. This is a severe fault since the lea...
متن کامل